Gaussian source coding with spherical codes
نویسندگان
چکیده
منابع مشابه
Gaussian source coding with spherical codes
A fixed-rate shape–gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in 1 onto a sphere in , and the gain codebook is a globally optimal scalar quantizer. A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio within 1 dB of the distortion-rate func...
متن کاملSum Rate of Multiterminal Gaussian Source Coding
We characterize the sum rate of a class of multiterminal Gaussian source coding problems with quadratic distortion constraints. The key component of the solution is the identification of a multiple antenna broadcast channel that serves as a test channel.
متن کاملDistributed Source Coding of Correlated Gaussian Sources
We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, · · · , L which are noisy observations of correlated Gaussian remote sources Xk, k = 1, 2, · · · ,K. We assume that Y L = (Y1, Y2, · · · , YL) is an observation of the source vector X = (X1, X2, · · · , XK), having the form Y L = AX+N, where A is a L×K matrix and N = (N1, N2, · · · , NL) is a vector ...
متن کاملPolar codes for distributed hierarchical source coding
Hierarchical source coding, also known as successive refinement of information, was introduced by Koshelev [1,2] and Equitz and Cover [3]. This problem is concerned with the construction of a source code for a discrete memoryless source X with respect to a given distortion measure d1 that can be further refined to represent the same source within another distortion measure d2 so that both repre...
متن کاملRate-adaptive codes for distributed source coding
Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on Low-Density Parity-Check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2002
ISSN: 0018-9448
DOI: 10.1109/tit.2002.804056